Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions

نویسنده

  • John H. Holland
چکیده

Building blocks are a ubiquitous feature at all levels of human understanding, froin perception through science and innovation. Genetic algorithms are designed to exploit this prevalence. A new, more robust class of genetic algorithms, cohort genetic algorithms (cGA's), provides substantial advantages in exploring search spaces for building blocks while exploiting building blocks already found. To test these capabilities, a new, general class of test functions, the hyperplane-defined functions (hdf's), has been designed. Hdf's offer the means of tracing the origin of each advance in performance; at the same time hdf's are resistant to reverse engineering, so that algorithms cannot be designed to take advantage of the characteristics of particular examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The MIT Press Journals

Building blocks are a ubiquitous feature at all levels of human understanding, from perception through science and innovation. Genetic algorithms are designed to exploit this prevalence. A new, more robust class of genetic algorithms, cohort genetic algorithms (cGA’s), provides substantial advantages in exploring search spaces for building blocks while exploiting building blocks already found. ...

متن کامل

Systematic, Controlled Observations of the Genetic Algorithm in a Regularly Changing Environment: Case Studies Using the Shaky Ladder Hyperplane Defined Functions

Systematic, Controlled Observations of the Genetic Algorithm in a RegularlyChanging Environment: Case Studies Using the Shaky Ladder Hyperplane DefinedFunctions byWilliam M. Rand Co-Chairs: John H. Holland and Rick L. Riolo Though recently there has been interest in examining genetic algorithms (GAs) indynamic environments, work still needs to be done in investigating the fundam...

متن کامل

Solving Additively Decomposable Functions by Building Blocks Identification

This paper proposes a way to use Building Blocks to improve solutions in Genetic Algorithm. Hard problems, for instance, Additively Decomposable Functions (ADFs) cannot be effectively solved by a standard algorithm such as Simple Genetic Algorithm. A single point crossover creates disruption of good solutions for such problems. We proposed using Building Blocks Identification and performed appr...

متن کامل

Practical Search Index as a Hardness Measure for Genetic Algorithms

Use of the Building Block Hypothesis to illuminate GA search behavior, as pursued by J. H. Holland and D. E. Goldberg, invites additional investigation.This paper investigates the space actually searched by a GA, in light of the Building Block Hypothesis, GA sampling and population size, in an effort to develop more quantitative measures of GA hardness for problems where building block sizes ca...

متن کامل

Multi-objective Optimization of Semi-active Control of Seismically Exited Buildings Using Variable Damper and Genetic Algorithms

Semi-active fluid viscous dampers as a subset of control systems have shown their ability to reduce seismic responses of tall buildings. In this paper, multi-objective optimization of the performance of this group of dampers in reducing the seismic responses of buildings is studied using multi-objective genetic algorithms. For numerical example, two 7 and 18 stories buildings are chosen and mod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Evolutionary computation

دوره 8 4  شماره 

صفحات  -

تاریخ انتشار 2000